Filled with fullerenes

Fullerenes with distant pentagons

For each d > 0, we find all the smallest fullerenes for which the least distance between two pentagons is d. We also show that for each d there is an hd such that fullerenes with pentagons at least distance d apart and any number of hexagons greater than or equal to hd exist. We also determine the number of fullerenes where the minimum distance between any two pentagons is at least d, for 1 ≤ d...

Bipartizing fullerenes

A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O( √ n) edges. This bound is asymptotically optimal.

Spin Quantum Computing with Endohedral Fullerenes

Complexation of carbon nanorings with fullerenes*

To explore the supramolecular properties of the hollow space of carbon nanotubes, the belt-shaped conjugated systems with sizable and deep cavities are intriguing molecules. Recently, we found that the “carbon nanorings”, cyclic [6]paraphenyleneacetylene ([6]CPPA), and the related compounds involving two naphthylene rings, form stable inclusion complexes with fullerenes in solution as well as i...

Antigenicity of fullerenes: antibodies specific for fullerenes and their characteristics.

The recent interest in using Buckminsterfullerene (fullerene) derivatives in biological systems raises the possibility of their assay by immunological procedures. This, in turn, leads to the question of the ability of these unprecedented polygonal structures, made up solely of carbon atoms, to induce the production of specific antibodies. Immunization of mice with a C60 fullerene derivative con...